On the minimum number of unitaries needed to describe a random-unitary channel
نویسنده
چکیده
We provide, in an extremely simple way, an upper bound to the minimum number of unitary operators describing a general randomunitary channel.
منابع مشابه
Implementing Unitary 2-Designs Using Random Diagonal-unitary Matrices
Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diago...
متن کاملAsymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
Decomposing unitaries into a sequence of elementary operations is at the core of quantum computing. Information theoretic arguments show that approximating a random unitary with precision ε requires Ω(log(1/ε)) gates. Prior to our work, the state of the art in approximating a single qubit unitary included the Solovay-Kitaev algorithm that requires O(log(3+δ)(1/ε)) gates and does not use ancilla...
متن کاملStatistical bounds on the dynamical production of entanglement
Abstract We present a random-matrix analysis of the entangling power of a unitary operator as a function of the number of times it is iterated. We consider unitaries belonging to the circular ensembles of random matrices (CUE or COE) applied to random (real or complex) non-entangled states. We verify numerically that the average entangling power is a monotonic decreasing function of time. The s...
متن کاملAdditivity and Distinguishability of Random Unitary Channels
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output p-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximat...
متن کاملExact Synthesis of Single-qubit Unitaries over Clifford-cyclotomic Gate Sets
We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input an exactly synthesizable single-qubit unitary–one which can be expressed without error as a product of Clifford and T gates–and outputs a sequence of gates which implements it. The algorithm is optimal i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006